#include <ctype.h>
#include <limits.h>
#include <math.h>
#include <stdbool.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>

#include "uthash.h"

/**
 * Definition for a binary tree node.
 */
struct TreeNode {
    int val;
    struct TreeNode *left;
    struct TreeNode *right;
};
typedef struct TreeNode treeNode, *treeNodePtr;

int kthLargest(struct TreeNode* root, int k);
void inOrder_dfs(treeNodePtr root);

int main()
{
	return 0;
}

int countdown, res;
int kthLargest(struct TreeNode* root, int k){
	countdown = k;
	inOrder_dfs(root);
	return res;
}

void inOrder_dfs(treeNodePtr root) {
	if (!root) return;
	inOrder_dfs(root->right);
	if (!--countdown) res = root->val;
	inOrder_dfs(root->left);
}
